Necessary and Sufficient Conditions for Stability of a Bin-packing System

نویسندگان

  • C. COURCOUBETIS
  • R. R. WEBER
چکیده

Objects of various integer sizes, o,, o , are to be packed together into bins of size N as they arrive at a service facility. The number of objects of size o, which arrive by time t is A , where the components of A' = (A , * , A ')' are independent renewal processes, with A'/t A as t --oo. The empty space in those bins which are neither empty nor full at time t is called the wasted space and the system is declared stabilizable if for some finite B there exists a bin-packing algorithm whose use guarantees the expected wasted space is less than B for all t. We show that the system is stabilizable if the arrival processes are Poisson and A lies in the interior of a certain convex polyhedral cone A. In this case there exists a bin-packing algorithm which stabilizes the system without needing to know A. However, if A lies on the boundary of A the wasted space grows as O(V\t) and if A is exterior to A it grows as O(t); these conclusions hold even if objects may be repacked as often as desired. ONLINE ALGORITHMS; RANDOM WALKS; STOCHASTIC ALGORITHMS 1. Problem description and results In a one-dimensional bin-packing model we suppose that objects of various integer sizes in the set O = {o1, , o *, n} are to be packed together into bins of integer size N as they arrive at a service facility. The number of objects of size o, which arrive by time t is A', where the components of A' = (A, * , A t)' are independent renewal processes, with A'/t-A =(A,' , An)' as t -o. The empty space in those bins which are neither empty nor full at time t is called the wasted space and this is denoted by W'. The system is declared stabilizable if for some finite B there exists a bin-packing algorithm whose use guarantees that the expected wasted space is less than B for all t. Of course this is equivalent to the notion that the expected number of partially full bins remains uniformly bounded as time increases. Received 26 July 1985; revision received 29 October 1985. * Postal address: AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974, USA. ** Postal address: Queens' College, Cambridge CB3 9ET, UK.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items

In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...

متن کامل

The probabilistic behaviour of the NFD Bin Packing algorithm

We give necessary and sufficient conditions for an infinitary language to be written by an infini tary code. It is shown that the "Theorem of defect" remains valid for the case of infinitary languages and codes, and that if a recognizable infinitary language is written by an infinitary code, it can be also written by a recognizable infinitary code. INSTITUTE OF MATHEMATICS P/0 BOX 631 BO HO HAN...

متن کامل

Voltage Stability Constrained OPF Using A Bilevel Programming Technique

This paper presents a voltage stability constrained optimal power flow that is expressed via a bilevel programming framework. The inner objective function is dedicated for maximizing voltage stability margin while the outer objective function is focused on minimization of total production cost of thermal units. The original two stage problem is converted to a single level optimization problem v...

متن کامل

On Sum and Stability of Continuous $G$-Frames

In this paper, we give some conditions under which the finite sum of continuous $g$-frames is again a continuous $g$-frame. We give necessary and sufficient conditions for the continuous $g$-frames $Lambda=left{Lambda_w in Bleft(H,K_wright): win Omegaright}$ and $Gamma=left{Gamma_w in Bleft(H,K_wright): win Omegaright}$ and operators $U$ and $V$ on $H$ such that $Lambda U+Gamma V={Lambda_w U+Ga...

متن کامل

On reducibility of weighted composition operators

In this paper, we study two types of the reducing subspaces for the weighted composition operator $W: frightarrow ucdot fcirc varphi$ on $L^2(Sigma)$. A necessary and sufficient condition is given for $W$ to possess the reducing subspaces of the form $L^2(Sigma_B)$ where $Bin Sigma_{sigma(u)}$. Moreover, we pose some necessary and some sufficient conditions under which the subspaces of the form...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008